National Repository of Grey Literature 32 records found  1 - 10nextend  jump to record: Search took 0.01 seconds. 
ECG Cluster Analysis
Pospíšil, David ; Kozumplík, Jiří (referee) ; Klimek, Martin (advisor)
This diploma thesis deals with the use of some methods of cluster analysis on the ECG signal in order to sort QRS complexes according to their morphology to normal and abnormal. It is used agglomerative hierarchical clustering and non-hierarchical method K – Means for which an application in Mathworks MATLAB programming equipment was developed. The first part deals with the theory of the ECG signal and cluster analysis, and then the second is the design, implementation and evaluation of the results of the usage of developed software on the ECG signal for the automatic division of QRS complexes into clusters.
Unsupervised Evaluation of Speaker Recognition System
Odehnal, Ondřej ; Plchot, Oldřich (referee) ; Matějka, Pavel (advisor)
Tato práce je vystavěna nad moderním systémem pro rozpoznávání mluvčího (SID) založeného na x-vektorech. Cílem bakalářské práce je navrhnout a experimentálně vyhodnotit techniky pro evaluaci SID systému za použití audio nahrávek bez anotace tj. bez znalosti mluvčího. Pro tento účel je z každé nahrávky bez anotace vytvořen embedding. Ty se poté používají pro shlukování nahrávek a následné vytvoření pseudo-anotací. Na těchto anotacích se SID systém evaluuje pomocí equal error rate (EER) metriky. Za účelem vytvoření pseudo-anotací byly navrženy tyto shlukovací algoritmy učení bez učitele: K-means, Gaussian mixture models (GMM) a aglomerativní shlukování. Po testování vyšel jakožto nejlepší experimentální postup K-means se Silhouette metrikou, která používá kosinovou podobnost jako míru vzdálenosti. Nejlepší metoda dosáhla 5,72 % EER s referenčním EER = 5,15 %, které bylo spočítané se znalostí anotace na části datasetu SITW dev-core-core. Podobné výsledky byly získány na části datasetu SITW eval-core-core s odhadnutým EER = 5,86 % a referenčním 5,08 %. Rozdíl mezi hodnotami tvoří 0,57 % pro eval-core-core a 0, 78% pro dev-core-core. Další testy na NIST SRE16 a VoxCeleb1 datasetech byly provedeny za účelem ověření správnosti navrženého postupu. Obecně se dá říct, že navržený testovací postup měl chybu přibližně 1 %, což je poměrně dobrý výsledek pro algoritmus učení bez učitele.
Data Mining Case Study in Python
Stoika, Anastasiia ; Burgetová, Ivana (referee) ; Zendulka, Jaroslav (advisor)
This thesis focuses on basic concepts and techniques of the process known as knowledge discovery from data. The goal is to demonstrate available resources in Python, which enable to perform the steps of this process. The thesis addresses several methods and techniques focused on detection of unusual observations, based on clustering and classification. It discusses data mining task for data with the limited amount of inspection resources. This inspection activity should be used to detect unusual transactions of sales of some company that may indicate fraud attempts by some of its salespeople.
Automatic image classification
Ševčík, Zdeněk ; Miklánek, Štěpán (referee) ; Sikora, Pavel (advisor)
The aim of this thesis is to explore clustering algorithms of machine unsupervised learning, which can be used for image database classification by similarity. For chosen clustering algorithms is written up a theoretical basis. For better classification of used database this thesis deals with different methods of image preprocessing. With these methods the features from image are extracted. Next the thesis solves of implementation of preprocessing methods and practical application of clustering algorithms. In practical part is programmed aplication in Python programming language, which classifies the database of images into classes by similarity. The thesis tests all of used methods and at the end of the thesis is processed searches of results.
Demonstrational Program for IZU Course
Hreha, Tomáš ; Šůstek, Martin (referee) ; Zbořil, František (advisor)
This bachelor thesis deals with the design of application for visualization of fundamental algorithms of artificial intelligence. The first part describes theoretical part of implemented topics and methods, next part briefly describes used technologies, reasons why they were used and their practical usage in context of result application. The next part is dedicated to user interface, its main components and describes ways how application interacts with user and how user can interact with application. The last part contains comparison with original demo applications and summarize results of application testing.
Classification of Testing Maneuvers from Flight Data
Funiak, Martin ; Dittrich, Petr (referee) ; Chudý, Peter (advisor)
Zapisovač letových údajů je zařízení určené pro zaznamenávání letových dat z různých senzorů v letadlech. Analýza letových údajů hraje důležitou roli ve vývoji a testování avioniky. Testování a hodnocení charakteristik letadla se často provádí pomocí testovacích manévrů. Naměřená data z jednoho letu jsou uložena v jednom letovém záznamu, který může obsahovat několik testovacích manévrů. Cílem této práce je identi kovat základní testovací manévry s pomocí naměřených letových dat. Teoretická část popisuje letové manévry a formát měřených letových dat. Analytická část popisuje výzkum v oblasti klasi kace založené na statistice a teorii pravděpodobnosti potřebnou pro pochopení složitých Gaussovských směšovacích modelů. Práce uvádí implementaci, kde jsou Gaussovy směšovací modely použité pro klasifi kaci testovacích manévrů. Navržené řešení bylo testováno pro data získána z letového simulátoru a ze skutečného letadla. Ukázalo se, že Gaussovy směšovací modely poskytují vhodné řešení pro tento úkol. Další možný vývoj práce je popsán v závěrečné kapitole.
Machine Learning - The Application for Demonstration of Main Approaches
Kefurt, Pavel ; Král, Jiří (referee) ; Zbořil, František (advisor)
This work mainly deals with the basic machine learning algorithms. In the first part, the selected algorithms are described. The remaining part is then devoted to the implementation of these algorithms and a demonstration of tasks for each of them.
Software demo of unsupervised learning
Slezák, Milan ; Sáblík, Václav (referee) ; Honzík, Petr (advisor)
The bachelor's thesis introduces the use of unsupervised learning and presents possibilities of cluster analysis. Software demo of unsupervised learning is a part of this thesis. This program was made as a teaching aid. It consists several input databases with different data distributions on the basis of which it is possible to explain very easily elementary principles of cluster analysis and differences between hierarchical clustering and partitional clustering.
Application of Unsupervised Learning Methods in Graph Similarity Search
Sabo, Jozef ; Burgetová, Ivana (referee) ; Křivka, Zbyněk (advisor)
Goal of this master's thesis was in cooperation with the company Avast to design a system, which can extract knowledge from a database of graphs. Graphs, used for data mining, describe behaviour of computer systems and they are anonymously inserted into the company's database from systems of the company's products users. Each graph in the database can be assigned with one of two labels: clean or malware (malicious) graph. The task of the proposed self-learning system is to find clusters of graphs in the graph database, in which the classes of graphs do not mix. Graph clusters with only one class of graphs can be interpreted as different types of clean or malware graphs and they are a useful source of further analysis on the graphs. To evaluate the quality of the clusters, a custom metric, named as monochromaticity, was designed. The metric evaluates the quality of the clusters based on how much clean and malware graphs are mixed in the clusters. The best results of the metric were obtained when vector representations of graphs were created by a deep learning model (variational  graph autoencoder with two relation graph convolution operators) and the parameterless method MeanShift was used for clustering over vectors.
Acceleration of Neurostimulation Using Artificial Intelligence Methods
Gaňo, Martin ; Chlebík, Jakub (referee) ; Jaroš, Jiří (advisor)
Treatment using transcranial ultrasound is a rapidly arising domain of medicine. This method brings options for non-invasive brain therapies, including ablation, neuromodulation, or potentially opening the blood-brain barrier for the following treatment. The health officer needs to constantly receive feedback on the ultrasound wavefield in the human skull in real-time to accomplish the cure using these techniques. The traditional methods for simulating monochromous ultrasound waves are computationally too expensive. That is why their usage would be infeasible for these purposes, and it brings the need for alternative methods. This work proposed and implemented a method to solve the Helmholtz equation in 3D space using a neural network achieving a faster convergence rate. The neural network design uses lightweight architecture based on UNet. The main interest of this work is neuromodulation because, in this application, it is possible to ignore several variables and phenomena that would not be negligible in other use cases. Omitting them from the calculations increased the chances of accomplishing computations in a reasonable time. The method is fully unsupervised and uses exclusively artificially generated spherical harmonics and physics-based loss for training, with no required ground truth labels. Results showed a faster calculation with acceptable error than other traditional methods.

National Repository of Grey Literature : 32 records found   1 - 10nextend  jump to record:
Interested in being notified about new results for this query?
Subscribe to the RSS feed.